Handling Temporal Faults in Ada 2005
نویسندگان
چکیده
Hard real-time systems have stringent deadline requirements, which can be guaranteed at system design time by restricting the computational model so that a careful analysis of execution-time budgets and response-time values can be performed. However, design-time guarantees are not enough in many high-integrity systems, in which some degree of run-time fault-tolerance has to be implemented as well. This paper deals with run-timemechanisms for temporal fault detection and recovery, based on some of the new features available in Ada 2005. Fault detection mechanisms are based on execution-time clocks and timers, and timing events. Fault recovery schemes are application-dependent, but somebasic patterns are proposed that can be used to develop such kinds of mechanisms.
منابع مشابه
Non-intrusive System Level Fault-Tolerance
High-integrity embedded systems operate in multiple modes, in order to ensure system availability in the face of faults. Unanticipated state-dependent faults that remain in software after system design and development behave like hardware transient faults: they appear, do the damage and disappear. The conventional approach used for handling task overruns caused by transient faults is to use a s...
متن کاملA Non-Intrusive Fault Tolerant Framework For Mission Critical Real-Time Systems
The need for dependable real-time systems for embedded application is growing, and, at the same time, so does the amount of functionality required from these systems. As testing can only show the presence of errors, not their absence, higher levels of system dependability may be provided by the implementation of mechanisms that can protect the system from faults. We present a framework for the ...
متن کاملHierarchical Scheduling with Ada 2005
Hierarchical scheduling is a basic technique to achieve temporal isolation between applications in high-integrity systems when an integrated approach is opted for over traditional federation. While comparatively heavyweight approaches to hierarchical scheduling have been prevailing until now, the new scheduling features of Ada 2005 enable lighter-weight techniques to be used. This will expected...
متن کاملA Comparison of the Mutual Exclusion Features in Ada and the Real-Time Specification for Java TM
A concurrent program generally comprises a collection of threads1 that interact cooperatively, either directly or through shared data objects. In the latter case the sharing needs to be implemented by some mechanism that ensures mutually exclusive access, or possibly “concurrent read / exclusive write”. Ada and the Real-Time Specification for Java have taken different approaches to mutual exclu...
متن کاملSelf-stabilizing Checkpointing Algorithm in Ring Topology
If the variables used for the checkpointing algorithm have data faults, the algorithm may fail. In this paper, a selfstabilizing checkpointing algorithm is proposed for handling data faults in a ring network. The proposed algorithm can deal with concurrent initiation of checkpointing and at most one data fault per process. However, several processes may be faulty.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007